Decidability and complexity of fibred logics without shared connectives
نویسندگان
چکیده
منابع مشابه
Decidability and complexity of fibred logics without shared connectives
Fibring is a powerful mechanism for combining logics, and an essential tool for designing and understanding complex logical systems. Abstract results about the semantics and proof-theory of fibred logics have been extensively developed, including general preservation results for metalogical properties like soundness and (sufficient conditions for) completeness. Decidability, however, a key ingr...
متن کاملConservativity of Fibred Logics without Shared Connectives *
Fibring is a general mechanism for combining logics that provides valuable insight on designing and understanding complex logical systems. Mostly, the research on fibring has focused on its model and proof-theoretic aspects, and on transference results for relevant metalogical properties. Conservativity, however, a property that lies at the very heart of the original definition of fibring, has ...
متن کاملDeciding theoremhood in fibred logics without shared connectives
Fibring is a powerful mechanism for combining logics, and an essential tool for designing and understanding complex logical systems. Abstract results about the semantics and proof-theory of fibred logics have been extensively developed, including general soundness and completeness preservation results. Decidability, however, a key ingredient for the automated support of the fibred logic, has no...
متن کاملLogics for Real Time: Decidability and Complexity
Over the last fifteen years formalisms for reasoning about metric properties of computations were suggested and discussed. First as extensions of temporal logic, ignoring the framework of classical predicate logic, and then, with the authors’ work, within the framework of monadic logic of order. Here we survey our work on metric logic comparing it to the previous work in the field. We define a ...
متن کاملElementary Modal Logics – Decidability and Complexity
Modal logic was first introduced by philosophers to study the deductive behaviour of the expressions it is necessary that and it is possible that. Nowadays, it is widely used in several areas of computer science, including formal verification and artificial intelligence. Syntactically, modal logic extends propositional logic by two unary operators: ♦ and . The formal semantics is usually given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of IGPL
سال: 2016
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/jzw033